Attaching Multiple Prepositional Phrases: Generalized Backed-oo Estimation
نویسندگان
چکیده
There has recently been considerable interest in the use of lexically-based statistical techniques to resolve preposition-al phrase attachments. To our knowledge , however, these investigations have only considered the problem of attaching the rst PP, i.e., in a V NP PP] conngura-tion. In this paper, we consider one technique which has been successfully applied to this problem, backed-oo estimation, and demonstrate how it can be extended to deal with the problem of multiple PP attachment. The multiple PP attachment introduces two related problems: sparser data (since multiple PPs are naturally rarer), and greater syntactic ambiguity (more attachment conngurations which must be distinguished). We present and algorithm which solves this problem through re-use of the relatively rich data obtained from rst PP training, in resolving subsequent PP attachments .
منابع مشابه
Attaching Multiple Prepositional Phrases: Generalized Backed-off Estimation
There has recently been considerable interest in the use of lexically-based statistical techniques to resolve prepositional phrase attachments. To our knowledge, however, these investigations have only considered the problem of attaching the first PP, i.e., in a [V NP PP] configuration. In this paper, we consider one technique which has been successfully applied to this problem, backed-off esti...
متن کاملPrepositional Phrase Attachment through a Backed-O Model
Recent work has considered corpus-based or statistical approaches to the problem of prepositional phrase attachment ambiguity. Typically, ambiguous verb phrases of the form v np1 p np2 are resolved through a model which considers values of the four head words (v, n1, p and n2). This paper shows that the problem is analogous to n-gram language models in speech recognition, and that one of the mo...
متن کاملA Labelled Corpus for Prepositional Phrase Attachment
This paper describes a labelled corpus intended for training learning algorithms to attach prepositional phrases (PPs). Taken from the PTB2, we believe it is the largest available resource for this purpose, especially as it contains many patterns in which PPs occur ambiguously (nearly all previous research has focused on just one pattern) and we present some results for the five most common pat...
متن کاملIntegration of Semantic and Syntactic Constraints for Structural Noun Phrase Disambiguation
A fundamental problem in Natural Language Processing is the integration of syntactic and semantic constraints. In this paper we describe a new approach for the integration of syntactic and semantic constraints which takes advantage of a learned memory model. Our model combines localist representations for the integration of constraints and distributed representations for learning semantic const...
متن کاملPrepositional Phrase Attachment Disambiguation using WordNet
In this thesis we use a knowledge-based approach to disambiguating prepositional phrase attachments in English sentences. This method was first introduced by S. M. Harabagiu. The Penn Treebank corpus is used as the training text. We extract 4-tuples of the form [ V P , NP1, Prep, NP2 ] and sort them into classes according to the semantic relationships between parts of each tuple. These relation...
متن کامل